Complexity Bounds for Ordinal-Based Termination - (Invited Talk)
نویسنده
چکیده
‘What more than its truth do we know if we have a proof of a theorem in a given formal system?’ We examine Kreisel’s question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program running times. Our main tool for this are length function theorems, which provide complexity bounds on the use of well quasi orders. We illustrate how to prove such theorems in the simple yet until now untreated case of ordinals. We show how to apply this new theorem to derive complexity bounds on programs when they are proven to terminate thanks to a ranking function into some ordinal. 1998 ACM Subject Classification. F.2.0 Analysis of Algorithms and Problem Complexity; F.3.1 Logics and Meanings of Programs
منابع مشابه
Complexity Bounds for Ordinal-Based Termination
‘What more than its truth do we know if we have a proof of a theorem in a given formal system?’ We examine Kreisel’s question in the particular context of program termination proofs, with an eye to deriving complexity bounds on program running times. Our main tool for this are length function theorems, which provide complexity bounds on the use of well quasi orders. We illustrate how to prove s...
متن کاملOrdinal Bounds for Programs
In this paper we use methods of proof theory to assign ordinals to classes of (terminating) programs, the idea being that the ordinal assignment provides a uniform way of measuring computational complexity \in the large". We are not concerned with placing prior (e.g. polynomial) bounds on computation{length, but rather with general methods of assessing the complexity of natural classes of progr...
متن کاملOrdinal recursive complexity of Unordered Data Nets
Data Nets are a version of colored Petri nets in which tokens carry data taken from an infinite, linearly ordered and dense domain. This class is interesting because, even though very expressive, their coverability/termination problems remain decidable. Those problemas have recently been proven complete for the class Fωωω in the fast growing complexity hierarchy. In this paper we characterize t...
متن کاملSpace and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk)
We discuss open questions around worst case time and space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior.
متن کاملA Novel Method for Detection of Epilepsy in Short and Noisy EEG Signals Using Ordinal Pattern Analysis
Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...
متن کامل